Multifrontal solution of sparse unsymmetric matrices arising from semiconductor equations

نویسندگان

  • A. El Boukili
  • A. Madrane
  • R. Vaillancourt
چکیده

The multifrontal LU method is implemented to solve drift-diffusion models with large sparse matrices arising in the simulation and optimization of semiconductor devices. The performance of this method is compared with the LU algorithm without multifrontal scheme on different computers in the case of a realistic double heterojunction transistor. Résumé On emploie un méthode LU multifrontale pour résoudre un modèle de transport-diffusion à grande matrice creuse qu’on retrouve dans la simulation et l’optimisation de semiconducteurs. On compare la performance de cette méthode et celle de l’algorithme LU non multifrontal sur différents ordinateurs dans le cas d’un transistor à hétérojonction double.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NUMERICAL ANALYSIS GROUP PROGRESS REPORT January 1994 – December 1995

2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...

متن کامل

Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices

We present algorithms for the symbolic and numerical factorization phases in the direct solution of sparse unsymmetric systems of linear equations. We have modified a classical symbolic factorization algorithm for unsymmetric matrices to inexpensively compute minimal elimination structures. We give an efficient algorithm to compute a near-minimal data-dependency graph for unsymmetric multifront...

متن کامل

Unsymmetric-pattern Multifrontal Methods for Parallel Sparse Lu Factorization

Sparse matrix factorization algorithms are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method replace irregular operations with dense matrix kernels. However, no e cient method based primarily on dense matrix kernels exists for matrices whose pattern is very u...

متن کامل

An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization

Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method avoid indirect addressing in the innermost loops by using dense matrix kernels. However, no efficient LU factorization algorithm based primarily ...

متن کامل

IMF: An Incomplete Multifrontal LU-Factorization for Element-Structured Sparse Linear Systems

We propose an incomplete multifrontal LU-factorization (IMF) preconditioner that extends supernodal multifrontal methods to incomplete factorizations. It can be used as a preconditioner in a Krylov-subspace method to solve large-scale sparse linear systems with an element structure; e.g., those arising from a finite element discretization of a partial differential equation. The fact that the el...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004